The Number of Unary Clones Containing the Permutations on an Infinite Set

نویسنده

  • MICHAEL PINSKER
چکیده

We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, sometimes as large as the whole clone lattice. 1. Background and the result Fix a set X and consider for all n ≥ 1 the set O(n) of n-ary operations on X. If we take the union O = ⋃ n≥1 O (n) over these sets, we obtain the set of all operations on X of finite arity. A clone is a subset of O which contains all functions of the form π k (x1, . . . , xn) = xk (1 ≤ k ≤ n), called the projections, and which is closed under composition of functions. With the order of set-theoretical inclusion, the clones on X form a complete algebraic lattice Cl(X). We wish to describe this lattice for infinite X, in which case it has cardinality 22 |X| . A clone is called unary iff it contains only essentially unary functions, i.e., functions which depend on only one variable. Unary clones correspond in an obvious way to submonoids of the full transformation monoid O(1) and we shall not distinguish between the two notions in the following. We say that a unary clone C 6= O(1) is precomplete or maximal iff C together with any unary function f ∈ O(1) \ C generate O(1), i.e. iff the smallest clone containing C as well as f is O(1). In [Pin0x], the author determined all precomplete submonoids of the full transformation monoid O(1) which contain the permutations for all infinite X, which was a generalization from the countable ([Gav65]). The number of such clones turned out to be rather small compared with the size of the clone lattice: On infiniteX of cardinality אα there exist 2|α| + 5 precomplete unary clones, so in particular there are only five precomplete unary clones on countably infinite X. Theorem 1. Let X be an infinite set. If X has regular cardinality, then the precomplete submonoids of O(1) which contain the permutations are exactly 1991 Mathematics Subject Classification. Primary 08A40; secondary 08A05.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Clones on Uncountable Sets That Include All Permutations

We first determine the maximal clones on a set X of infinite regular cardinality κ which contain all permutations but not all unary functions, extending a result of Heindorf’s for countably infinite X. If κ is countably infinite or weakly compact, this yields a list of all maximal clones containing the permutations since in that case the maximal clones above the unary functions are known. We th...

متن کامل

Clones containing all almost unary functions

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all such clones are finitely generated over the unary functions. In particular, we obtain an explicit description of the only maximal clone in this part of the ...

متن کامل

Unary polynomials in algebras, I

The unary algebraic functions of an algebra already determine the congruences. Therefore , investigations of algebras with some prescribed propert ies of congruences can be divided into two major steps. First, one characterizes the monoid of unary algebraic functions of the algebra. Secondly, one tries to build up the algebra, knowing its unary algebraic functions. Of course we may only aim at ...

متن کامل

Precomplete Clones on Infinite Sets Which Are Closed under Conjugation

We show that on an infinite set, there exist no other precomplete clones closed under conjugation except those which contain all permutations. Since on base sets of some infinite cardinalities, in particular on countably infinite ones, the precomplete clones containing the permutations have been determined, this yields a complete list of the precomplete conjugation-closed clones in those cases....

متن کامل

Clones on Regular Cardinals

We investigate the structure of the lattice of clones on an infinite set X . We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg’s theorem: there are 2 λ many maximal (= “precomplete”) clones on a set of size λ. The clones we construct do not contain all unary functions. We then investigate clones that do contain all unary functions. Using a stron...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008